A local convergence analysis of bilevel decomposition algorithms
نویسندگان
چکیده
منابع مشابه
A Local Convergence Analysis of Bilevel Decomposition Algorithms
Multidisciplinary design optimization (MDO) problems are engineering design problems that require the consideration of the interaction between several design disciplines. Due to the organizational aspects of MDO problems, decomposition algorithms are often the only feasible solution approach. Decomposition algorithms reformulate the MDO problem as a set of independent subproblems, one per disci...
متن کاملLocal Decomposition Algorithms
INTRODUCTION For an ideal I ⊂ P := k[X 1 ,…,X n ], many algorithms using Gröbner techniques are a direct consequence of the definition itself of Gröbner basis: among them we can list algorithms for computing syzygies, dimension, minimal bases, free resolutions, Hilbert function and other algebro-geometric invariants of an ideal; the explicit knowledge of syzygies allows moreover to compute idea...
متن کاملConvergence Analysis of Local Algorithms for Blind Decorrelation
In this paper we analyze and extend a class of adaptive networks for second order blind decorrelation of instantaneous signal mix tures Firstly we compare the performance of the decorrelation neural network employing global knowledge of the adaptive co e cients in with a similar structure whose coe cients are adapted via local output connections in Through statistical analyses the convergence b...
متن کاملConvergence Analysis of a Domain Decomposition Paradigm
We describe a domain decomposition algorithm for use in several variants of the parallel adaptive meshing paradigm of Bank and Holst. This algorithm has low communication, makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. We show that for an idealized version of the algorithm, the rate of convergen...
متن کاملALGORITHMS FOR BILEVEL OPTIMIZATIONNatalia
General multilevel nonlinear optimization problems arise in design of complex systems and can be used as a means of regularization for multicriteria optimization problems. Here for clarity in displaying our ideas, we restrict ourselves to general bilevel optimization problems, and we present two solution approaches. Both approaches use a trust-region globalization strategy, and they can be easi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization and Engineering
سال: 2006
ISSN: 1389-4420,1573-2924
DOI: 10.1007/s11081-006-6835-3